919 research outputs found

    A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone

    Full text link
    This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the completion time for the truck and drone (min-time TSP-D). This problem has gained a lot of attention in the last few years since it is matched with the recent trends in a new delivery method among logistics companies. To solve the TSP-D, we propose a hybrid genetic search with dynamic population management and adaptive diversity control based on a split algorithm, problem-tailored crossover and local search operators, a new restore method to advance the convergence and an adaptive penalization mechanism to dynamically balance the search between feasible/infeasible solutions. The computational results show that the proposed algorithm outperforms existing methods in terms of solution quality and improves best known solutions found in the literature. Moreover, various analyses on the impacts of crossover choice and heuristic components have been conducted to analysis further their sensitivity to the performance of our method.Comment: Technical Report. 34 pages, 5 figure

    A Unifying Framework in Vector-valued Reproducing Kernel Hilbert Spaces for Manifold Regularization and Co-Regularized Multi-view Learning

    Get PDF
    This paper presents a general vector-valued reproducing kernel Hilbert spaces (RKHS) framework for the problem of learning an unknown functional dependency between a structured input space and a structured output space. Our formulation encompasses both Vector-valued Manifold Regularization and Co-regularized Multi-view Learning, providing in particular a unifying framework linking these two important learning approaches. In the case of the least square loss function, we provide a closed form solution, which is obtained by solving a system of linear equations. In the case of Support Vector Machine (SVM) classification, our formulation generalizes in particular both the binary Laplacian SVM to the multi-class, multi-view settings and the multi-class Simplex Cone SVM to the semi-supervised, multi-view settings. The solution is obtained by solving a single quadratic optimization problem, as in standard SVM, via the Sequential Minimal Optimization (SMO) approach. Empirical results obtained on the task of object recognition, using several challenging datasets, demonstrate the competitiveness of our algorithms compared with other state-of-the-art methods.Comment: 72 page

    Modelling and Fast Terminal Sliding Mode Control for Mirror-based Pointing Systems

    Full text link
    In this paper, we present a new discrete-time Fast Terminal Sliding Mode (FTSM) controller for mirror-based pointing systems. We first derive the decoupled model of those systems and then estimate the parameters using a nonlinear least-square identification method. Based on the derived model, we design a FTSM sliding manifold in the continuous domain. We then exploit the Euler discretization on the designed FTSM sliding surfaces to synthesize a discrete-time controller. Furthermore, we improve the transient dynamics of the sliding surface by adding a linear term. Finally, we prove the stability of the proposed controller based on the Sarpturk reaching condition. Extensive simulations, followed by comparisons with the Terminal Sliding Mode (TSM) and Model Predictive Control (MPC) have been carried out to evaluate the effectiveness of the proposed approach. A comparative study with data obtained from a real-time experiment was also conducted. The results indicate the advantage of the proposed method over the other techniques.Comment: In Proceedings of the 15th International Conference on Control, Automation, Robotics and Vision (ICARCV 2018

    Sampling strategies for forest aerial detection survey in Colorado

    Get PDF
    2015 Summer.Aerial detection survey (ADS) has been commonly employed in forest surveys in the United States for detecting forest damage and monitoring forest health. In Colorado, ADS by USDA Forest Service has conducted annual 100% census of government forested land for more than 20 years with the goal of achieving information about forest damage due to different causal agents and disorders. Sketchmapping has been commonly employed in ADS with the goal of detecting and documenting on maps mortality, defoliation and other visible forest change from aircraft. At medium and large scale, sketchmapping is a suitable technique for forest monitoring that provides valuable information in forest health. This dissertation deals with data of forest area damaged by five causal agents mountain pine beetle, spruce beetle, western spruce budworm, pin engraver, and Douglas fir beetle and two disorders subalpine fir mortality and sudden aspen decline. The combined areas damaged by all causes were also considered. Data were downloaded from ADS in Colorado from 1994 to 2013 as polygon shapefiles with associated information such as causal agents or disorders, area damaged, and type of forest. The goal of my dissertation was to identify an appropriate sampling strategies to archive good estimates of total area damaged, to decrease survey cost, and to increase safety by reducing the amount of flights. To approach this goal, four sample designs for estimating total area damaged caused by various causal agent were evaluated: simple random sampling, stratified random sampling, probability proportional to size, and non-alignment systematic sampling. A GIS layer of 150 transects covering Colorado’s forestlands was developed and represented the sample unit for my study. Each transect was 3.2 km wide and 625 km long and was numbered from 1 to 150 from south to north. Each sample design was evaluated using eight sample sizes (10, 15, 20, 25,30, 35, 50, and 70) and applied to the seven damages and the combined damaged area. The statistical properties were evaluated to determine the optimal sample design for estimating area damaged caused by different causal agents. The spatio-temporal characteristics of area damaged that influence precision and accuracy of estimate were considered. Most of the damaged forest areas by single causal agents and disorders showed aggregated spatial patterns; whereas the combined damaged areas were uniformly distributed across the landscape. A loss plus cost function was employed to determine the optimal sample size for each sample design and analyzed for the cost advantage of alternative sample designs. We found that stratified random sampling was the most optimal sample design by producing the highest percentage of unbiased estimates of total area damaged and the smallest variances. The next best sampling designs were simple random sampling and probability proportional to size. The non-alignment systematic sampling was the worst for estimating total area damaged both for individual causal agents and disorders and all causal agents combined. The optimal sample size varied by sample design and causal agents and disorders as well as the level of confidence. Optimal sample size increased with increasing variability in the population and as the desired level of confidence increased. Larger samples were required to simultaneously provide estimates for multiple causal agents and disorder with reasonable levels of precision when compared to a single causal agent. Stratified random sampling was the most cost effective when compared with other sample designs. For example, the cost advantage of stratified sampling over random sampling for estimating the damage from subalpine-fir mortality was 85,000peryear.Incontrast,PPSsamplinghadacostdisadvantageof85,000 per year. In contrast, PPS sampling had a cost disadvantage of -13,000 per year when compared with simple random sampling and -$95,000 per year when compared with stratified sampling for estimating the total damage from all causal agents combined at the 0.95 level of confidence
    corecore